A Distributed Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
نویسندگان
چکیده
منابع مشابه
A Distributed Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
We propose a distributed mutual exclusion algorithm for mobile ad hoc networks. This algorithm requires a ring of cluster coordinators as the underlying topology. The topology is built by first providing clusters of mobile nodes in the first step and then forming a backbone consisting of the cluster heads in a ring as the second step. The modified version of the Ricart-Agrawala Algorithm on top...
متن کاملA distributed mutual exclusion algorithm for mobile ad-hoc networks
A distributed mutual exclusion algorithm based on token exchange and well suited for mobile ad-hoc networks is presented along with a simulation study. The algorithm is based onto a dynamic logical ring and combines the best from the two families of token based algorithms (i.e., tokenasking and circulating token) in order to get a number of messages exchanged per CS access (the main performance...
متن کاملA Mutual Exclusion Algorithm for Ad Hoc Mobile Networks
A fault-tolerant distributed mutual exclusion algorithm that adjusts to node mobility is presented, along with proof of correctness and simulation results. The algorithm requires nodes to communicate with only their current neighbors, making it well-suited to the ad hoc environment. Experimental results indicate that adaptation to mobility can improve performance over that of similar non-adapti...
متن کاملA Group Mutual Exclusion Algorithm for Ad Hoc Mobile Networks
In this paper, we propose a token based algorithm to solve the group mutual exclusion (GME) problem for ad hoc mobile networks. The proposed algorithm is adapted from the RL algorithm in [WWV98] and utilizes the concept of weight throwing in [Tse95]. We prove that the proposed algorithm satisfies the mutual exclusion, the bounded delay, and the concurrent entering properties. The proposed algor...
متن کاملA Mutual Exclusion Algorithm for Ad Hoc Mobile Networks 1
A fault-tolerant distributed mutual exclusion algorithm which adjusts to node mobility is presented, along with proof of correctness and simulation results. The algorithm requires nodes to communicate with only their current neighbors, making it well-suited to the ad hoc environment. Experimental results indicate that adaptation to mobility can improve performance over that of similar non-adapt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2012
ISSN: 0975-2293
DOI: 10.5121/ijcnc.2012.4209